package other;

import java.util.Arrays;

/**
 * @program: javase
 * @description: 斐波那契数列-递归法
 * @author: lld
 * @create: 2021-03-26 22:55
 **/
public class Fibonacci1 {
    public static void main(String[] args) {
        //1 1 2 3 5 8 13 21 34 55
//        int n=40;
//        long l1 = System.currentTimeMillis();
//        System.out.println(f(n));
//        long l2 = System.currentTimeMillis();
//        long l3 = System.currentTimeMillis();
//        System.out.println(f2(n));
//        long l4 = System.currentTimeMillis();
//        System.out.println(l2-l1);
//        System.out.println(l4-l3);
        System.out.println(1/100);
        System.out.println(1%100);
    }
    public static int f(int n){
        if(n<=0){
            return 0;
        }
        if(n==1||n==2){
            return 1;
        }
        return f(n-2)+f(n-1);
    }
    public static int f2(int n){
        //todo
        return -1;
    }
}
